The Weakest Failure Detector to Solve Mutual Exclusion
نویسندگان
چکیده
Mutual exclusion is not solvable in an asynchronous message-passing system where processes are subject to crash failures. Delporte-Gallet et. al. determined the weakest failure detector to solve this problem when a majority of processes are correct. Here we identify the weakest failure detector to solve mutual exclusion in any environment, i.e., regardless of the number of faulty processes. We also show a relation between mutual exclusion and consensus, arguably the two most fundamental problems in distributed computing. Specifically, we show that a failure detector that solves mutual exclusion is sufficient to solve non-uniform consensus but not necessarily uniform consensus.
منابع مشابه
Mutual exclusion in asynchronous systems with failure detectors
This paper defines the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem. This failure detector, which we call the trusting failure detector, and which we denote by T , is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector P . The pa...
متن کاملThe Weakest Failure Detector for Wait-Free, Eventually Fair Mutual Exclusion
We establish the necessary conditions for solving wait-free, eventually fair mutual exclusion in message-passing environments subject to crash faults. Wait-freedom guarantees that every correct hungry process eventually enters its critical section. Eventual fairness guarantees that every run has an infinite suffix during which no correct hungry process is overtaken more than b times. Previously...
متن کاملSynchronization Using Failure Detectors
Many important synchronization problems in distributed computing are impossible to solve (in a fault-tolerant manner) in purely asynchronous systems, where message transmission delays and relative processor speeds are unbounded. It is then natural to seek for the minimal synchrony assumptions that are sufficient to solve a given synchronization problem. A convenient way to describe synchrony as...
متن کاملA Weakest Failure Detector for Dining Philosophers with Eventually Bounded Waiting and Failure Locality 1
The dining philosophers (DP) problem is a fundamental distributed resource allocation problem. In large-scale and long-lived systems, the likelihood of process failure is high, thus sparking interest in fault-tolerant DP. Choy and Singh introduced the measure “failure locality”, which measures the maximum distance between a crashed process and any other process that is blocked from entering its...
متن کاملBrief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-passing systems. It also introduces a natural weakening of the well-known set agreement task, and show that, in some precise sense, it is the weakest non-local task in message-passing systems. We investigate the followi...
متن کامل